We prove that modal logic formulated in a language with the cover modality is exponentially more succinct than the usual box-and-diamond version. In contrast with this, we show that adding the so-called public announcement operator to the latter results in a modal system that is exponentially more succinct than the one based on the cover modality.

In ‘belief revision’ a theory is revised with a formula φ resulting in a revised theory . Typically, is in , one has to give up belief in by a process of retraction, and φ is in . We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory wherein the agent believes the negation of the revision formula, i.e., wherein is true. The revision with (...) φ is a program *φ that transforms this information state into a new information state. The transformation is described by a dynamic modal operator [*φ], that is interpreted as a binary relation [ [*φ] ] between information states. The next information state is computed from the current information state and the belief revision formula. If the revision is successful, the agent believes φ in the resulting state, i.e., Bφ is then true. To make this work, as information states we propose ‘doxastic epistemic models’ that represent both knowledge and degrees of belief. These are multi-modal and multi-agent Kripke models. They are constructed from preference relations for agents, and they satisfy various characterizable multi-agent frame properties. Iterated, revocable, and higher-order belief revision are all quite natural in this setting. We present, for an example, five different ways of such dynamic belief revision. One can also see that as a non-deterministic epistemic action with two alternatives, where one is preferred over the other, and there is a natural generalization to general epistemic actions with preferences. (shrink)

This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic, group announcement logic, and coalition announcement logic. In APAL we consider the informative consequences of any announcement, in GAL we consider the informative consequences of a group of agents all of which are simultaneously making known announcements. So this is more restrictive than APAL. Finally, CAL is as GAL except that we now quantify over anything the agents not in that group (...) may announce simultaneously as well. The logic CAL therefore has some features of game logic and of ATL. We show that when there are multiple agents in the language, the satisfiability problem is undecidable for APAL, GAL, and CAL. In the single agent case, the satisfiability problem is decidable for all three logics. (shrink)

In ‘belief revision’ a theory\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} is revised with a formula φ resulting in a revised theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. Typically, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document}, one has to give up belief in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} by a process (...) of retraction, and φ is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} wherein the agent believes the negation of the revision formula, i.e., wherein \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B\neg\varphi$$\end{document} is true. The revision with φ is a program *φ that transforms this information state into a new information state. The transformation is described by a dynamic modal operator [*φ], that is interpreted as a binary relation [ [*φ] ] between information states. The next information state is computed from the current information state and the belief revision formula. If the revision is successful, the agent believes φ in the resulting state, i.e., Bφ is then true. To make this work, as information states we propose ‘doxastic epistemic models’ that represent both knowledge and degrees of belief. These are multi-modal and multi-agent Kripke models. They are constructed from preference relations for agents, and they satisfy various characterizable multi-agent frame properties. Iterated, revocable, and higher-order belief revision are all quite natural in this setting. We present, for an example, five different ways of such dynamic belief revision. One can also see that as a non-deterministic epistemic action with two alternatives, where one is preferred over the other, and there is a natural generalization to general epistemic actions with preferences. (shrink)

To describe simultaneous knowledge updates for different subgroups we propose anepistemic language with dynamic operators for actions. The language is interpreted onequivalence states (S5 states). The actions are interpreted as state transformers. Two crucial action constructors are learning and local choice. Learning isthe dynamic equivalent of common knowledge. Local choice aids in constraining theinterpretation of an action to a functional interpretation (state transformer).Bisimilarity is preserved under execution of actions. The language is applied todescribe various actions in card games.

Pit is a multi-player card game that simulates the commodities trading market, and where actions consist of bidding and of swapping cards. We present a formal description of the knowledge and change of knowledge in that game. The description is in a standard language for dynamic epistemics expanded with assignment. Assignment is necessary to describe that cards change hands. The formal description is a prerequisite to model Pit in game theory. The main contribution of this paper should be seen as (...) the rigorous formalization of all knowledge in Pit. (shrink)

This contribution is a gentle introduction to so-called dynamic epistemic logics, that can describe how agents change their knowledge and beliefs. We start with a concise introduction to epistemic logic, through the example of one, two and finally three players holding cards; and, mainly for the purpose of motivating the dynamics, we also very summarily introduce the concepts of general and common knowledge. We then pay ample attention to the logic of public announcements, wherein agents change their knowledge as the (...) result of public announcements. One crucial topic in that setting is that of unsuccessful updates: formulas that become false when announced. The Moore-sentences that were already extensively discussed at the conception of epistemic logic in Hintikka’s ‘Knowledge and Belief’ give rise to such unsuccessful updates. After that, we present a few examples of more complex epistemic updates. Our closing observations are on recent developments that link the ‘standard’ topic of belief revision, as in ‘On the Logic of Theory Change: partial meet contraction and revision functions’, by Alchourron et al. , to the dynamic epistemic logics introduced here. (shrink)

Take your average publication on the dynamics of knowledge. In one of its first paragraphs you will probably encounter a phrase like “a logic of public announcements was first proposed by Plaza in 1989 (Plaza 1989).” Tracking down this publication seems easy, because googling its title ‘Logics of Public Communications’ takes you straight to Jan Plaza’s website where it is online available in the author’s own version, including, on that page, very helpful and full bibliographic references to the proceedings in (...) which it originally appeared. Those proceedings are then somewhat harder to find. In fact, I have never seen them. Unfortunately, for the research community, Plaza’s work has never been followed up by a journal version. I am very grateful to the editor Wiebe van der Hoek of the journal ‘Knowledge, Rationality, and Action’ to correct this omission.Plaza’s work is reprinted as such, without an update encompassing more than fifteen additional years of research in this area. This commentary aims to provide some background to bridge that gap. (shrink)

In unconditionally secure protocols, a sender and receiver are able to communicate their secrets to each other without the eavesdropper(s) being able to learn the secret, even when the eavesdropper intercepts the entire communication. We investigate such protocols for the special case of deals of cards over players, where two players aim to communicate to each other their hand of cards without the remaining player(s) learning a single card from either hand. In this contribution we show that a particular protocol (...) of length strictly larger than two (i.e., consisting of more than just one announcement by one player, and one other announcement by the other player) is after all not acceptable, and therefore does not constitute a new solution. The demonstration requires a detailed case-based analysis. The result may bring a general approach to arbitrary finite-length protocols closer. (shrink)

Les décisions politiques sur les risques environnementaux complexes font fréquemment intervenir des éléments scientifiques contestés. Il n’y a généralement pas de « faits » qui conduisent à une politique correcte unique. Les éléments de preuve qui sont intégrés dans les avis scientifiques destinés à une décision politique nécessitent une évaluation de leur qualité. En 2003, l’Agence néerlandaise d’évaluation environnementale a adopté une méthode standardisée, désignée sous le nom de « guide », dans le cadre de laquelle les principaux aspects de (...) la production et de l’utilisation des connaissances sont présentés grâce à une liste de contrôle visant à l’évaluation et à la communication des incertitudes. Dans cet article, nous présentons des résultats de l’application de ce guide à la controverse sur les risques des particules en suspension. La délibération active sur l’incertitude dans un contexte d’expertise entraîne un processus d’apprentissage commun entre les experts et les décideurs politiques, ce qui conduit à une meilleure prise de conscience du phénomène d’incertitude et de ses implications politiques.Policy decisions on complex environmental risks often involve disputed science. Typically, there are no “ facts” to support a single unequivocally correct policy. The evidence provided in scientific studies for policy-making decisions requires high-quality assessment. In 2003, the Netherlands Environmental Assessment Agency adopted a standardized method, referred to as “guidelines”, whereby key quality aspects of knowledge production and use are presented in the form of a checklist for uncertainty assessments and communication. In this article, we present the outcomes of applying the guidelines in controversies on the risks of ambient particulate matter. In the policy–advisory context, active deliberation on uncertainty produces a common learning process for advisors and policy makers, which leads to a deeper understanding and increased awareness of the phenomenon of uncertainty and its policy implications. (shrink)

Libraries provide access to large amounts of library metadata. Unfortunately, many libraries only offer textual interfaces for searching and browsing their holdings. Visualizations provide simpler, faster, and more efficient ways to navigate, search and study large quantities of metadata. This paper presents GlamMap, a visualization tool that displays library metadata on an interactive, computer-generated geographic map. We provide detailed discussion of how GlamMap benefits the work of librarians and researchers. We show how geographic representations help librarians to perform tasks such (...) as collection assessment and how geographic information helps researchers to identify important scientific resources. (shrink)

In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...) information state is called an unsuccessful update. A successful formula is a formula that always becomes common knowledge after being announced. Analysis of information systems and 'philosophical puzzles' reveals a growing number of dynamic phenomena that can be described or explained by unsuccessful updates. This increases our understanding of such philosophical problems. We also investigate the syntactic characterization of the successful formulas. (shrink)

Richard Taylor was born in Charlotte, Michigan on 5 November 1919. He received his A. B. from the University of illinois in 1941, his M. A. from Oberlin College in 1947, and his Ph. D. from Brown University in 1951. He has been William H. P. Faunce Professor of Philosophy at Brown University, Professor of Philosophy (Graduate Faculties) at Columbia University, and Professor of Philosophy at the University of Rochester. He is the author of about fifty articles and of five (...) philosophical books. This volume consists of essays presented to Richard Taylor on the occa sion of his sixtieth birthday. Some of the contributors have been Taylor'S students; some have been his colleagues; and all have been, and continue to be, his admirers. I have made several attempts to articulate what it is I (I would not presume to speak for anyone else) admire about Richard Taylor: (1) There is a particular 'flavor' to Taylor's philosophical writing and con versation that is wholly delightful. Like any other flavor, it can be tasted and enjoyed and remembered but never adequately described. (If there should be someone who has picked up this book who does not know what I mean, I recommend that he read the chapter on 'God' in Taylor's Metaphysics. ) (2) Taylor is a masterful dialectician. (shrink)

Meta-theories, base-theories and theories of practice in Pratical Theology The problem of meta-theories and base-theories, their interaction and the influence of each on the scientific process, have widely been debated in practical theology. In South Africa two meta-theories namely the system- theory together with the theory that social science is busy with the study of actions, are having the greater deal of attention. The purpose of this article is to point out the fact that an early and absolute choice of (...) particular meta-theories, restricts the work of practical theology because it will influence your base-theories, and can weaken the theological content of practical theology. An attempt is made to offer a model by which the interaction between, meta-theories, base-theories and theories of practice can he understood and which can also help the theologian, busy with practical theology, to steer clear of problems and understand the meta- influences in his own scientific work. (shrink)

BackgroundReducing the number of animals used in experiments has become a priority for the governments of many countries. For these reductions to occur, animal-free alternatives must be made more available and, crucially, must be embraced by researchers.MethodsWe conducted an international online survey for academics in the field of animal science (N = 367) to explore researchers’ attitudes towards the implementation of animal-free innovations. Through this survey, we address three key questions. The first question is whether scientists who use animals in (...) their research consider governmental goals for animal-free innovations achievable and whether they would support such goals. Secondly, responders were asked to rank the importance of ten roadblocks that could hamper the implementation of animal-free innovations. Finally, responders were asked whether they would migrate (either themselves or their research) if increased animal research regulations in their country of residence restricted their research.ResultsWhile nearly half (40%) of the responders support governmental goals, the majority (71%) of researchers did not consider such goals achievable in their field within the near future. In terms of roadblocks for implementation of animal-free methods, ~ 80% of the responders considered ‘reliability’ as important, making it the most highly ranked roadblock. However, all other roadblocks were reported by most responders as somewhat important, suggesting that they must also be considered when addressing animal-free innovations. Importantly, a majority reported that they would consider migration to another country in response to a restrictive animal research policy. Thus, governments must consider the risk of researchers migrating to other institutes, states or countries, leading to a ‘brain-drain’ if policies are too strict or suitable animal-free alternatives are not available.ConclusionOur findings suggest that development and implementation of animal-free innovations are hampered by multiple factors. We outline three pillars concerning education, governmental influence and data sharing, the implementation of which may help to overcome these roadblocks to animal-free innovations. (shrink)